Record-breaker on the surface
نویسندگان
چکیده
منابع مشابه
On the reliability of the U.S. surface temperature record
[1] Recent photographic documentation of poor siting conditions at stations in the U.S. Historical Climatology Network (USHCN) has led to questions regarding the reliability of surface temperature trends over the conterminous United States (CONUS). To evaluate the potential impact of poor siting/instrument exposure on CONUS temperatures, trends derived from poor andwell sited USHCN stations wer...
متن کاملTripping the HCN Breaker
Hyperpolarization-activated cyclic nucleotide-gated (HCN) channels regulate neuronal excitability, pacemaking, dendritic integration, and homeostatic plasticity and are culprits in aberrant neuronal activity in certain epilepsies. In this issue of Neuron two manuscripts (Santoro et al. and Zolles et al.) report that HCN channel gating and expression are controlled by Trip8b (Pex5R) but with a b...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولHamiltonian Maker-Breaker games on small graphs
We look at the unbiased Maker-Breaker Hamiltonicity game played on the edge set of a complete graph Kn, where Maker’s goal is to claim a Hamiltonian cycle. First, we prove that, independent of who starts, Maker can win the game for n = 8 and n = 9. Then we use an inductive argument to show that, independent of who starts, Maker can win the game if and only if n ≥ 8. This, in particular, resolve...
متن کاملGlobal Maker-Breaker games on sparse graphs
In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Materials Today
سال: 2004
ISSN: 1369-7021
DOI: 10.1016/s1369-7021(04)00171-3